Generalizing the h- and g-indices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating Process Capability Indices Using Univariate g and h Distribution

Process capability of a process is defined as inherent variability of a process which is running under chance cause of variation only. Process capability index is measuring the ability of a process to meet the product specification limit. Generally process capability is measured by 6 assuming that the product characteristic follows Normal distribution. In many practical situations the product ...

متن کامل

On the distance based indices of H-phenylenic nanotorus

Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...

متن کامل

Possible and Necessary h-Indices

The problem of measuring scientific impact is considered. A class of so-called p-sphere indices, which generalize the well known Hirsch index, is used to construct a possibility measure of scientific impact. This measure might be treated as a starting point for prediction of future index values or for dealing with right-censored bibliometric data. Keywords— Hirsch’s h-index, p-sphere indices, s...

متن کامل

Generalizing the Inversion Enumerator to G-Parking Functions

We consider a generalization of the inversion enumerator for G-parking functions, IG(q). We find several recurrences for IG(−1), including a recursive formula whenever G is the cone over a tree. We relate IG(−1) to the number of partial orientations of G. Using the connection between IG and the Tutte Polynomial, we find another recursive formula for IG(−1). For any partial cone G over a tree T ...

متن کامل

Assessing h- and g-Indices of Scientific Papers using k-Means Clustering

K-means clustering technique works as a greedy algorithm for partition the n-samples into k-clusters so as to reduce the sum of the squared distances to the centroids. A very familiar task in data analysis is that of grouping a set of objects into subsets such that all elements within a group are more related among them than they are to the others. K-means clustering is a method of grouping ite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Informetrics

سال: 2008

ISSN: 1751-1577

DOI: 10.1016/j.joi.2008.09.004